Concentration functions and entropy bounds for discrete log-concave distributions
نویسندگان
چکیده
Abstract Two-sided bounds are explored for concentration functions and Rényi entropies in the class of discrete log-concave probability distributions. They used to derive certain variants entropy power inequalities.
منابع مشابه
A Universal Generator for Discrete Log-concave Distributions
We give an algorithm that can be used to sample from any discrete log-concave distribution (e.g. the binomial and hypergeometric distributions). It is based on rejection from a discrete dominating distribution that consists of parts of the geometric distribution. The algorithm is uniformly fast for all discrete log-concave distributions and not much slower than algorithms designed for a single ...
متن کاملLearning Multivariate Log-concave Distributions
We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on Rd, for all d ≥ 1. Prior to our work, no upper bound on the sample complexity of this learning problem was known for the case of d > 3. In more detail, we give an estimator that, for any d ≥ 1 and ǫ > 0, draws Õd ( (1/ǫ...
متن کاملDivergence for s-concave and log concave functions
We prove new entropy inequalities for log concave and s-concave functions that strengthen and generalize recently established reverse log Sobolev and Poincaré inequalities for such functions. This leads naturally to the concept of f -divergence and, in particular, relative entropy for s-concave and log concave functions. We establish their basic properties, among them the affine invariant valua...
متن کاملInference and Modeling with Log-concave Distributions
Log-concave distributions are an attractive choice for modeling and inference, for several reasons: The class of log-concave distributions contains most of the commonly used parametric distributions and thus is a rich and flexible nonparametric class of distributions. Further, the MLE exists and can be computed with readily available algorithms. Thus, no tuning parameter, such as a bandwidth, i...
متن کاملValuations on Log-Concave Functions
A classification of SL(n) and translation covariant Minkowski valuations on log-concave functions is established. The moment vector and the recently introduced level set body of log-concave functions are characterized. Furthermore, analogs of the Euler characteristic and volume are characterized as SL(n) and translation invariant valuations on log-concave functions. 2000 AMS subject classificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability & Computing
سال: 2021
ISSN: ['0963-5483', '1469-2163']
DOI: https://doi.org/10.1017/s096354832100016x